Irregular and multi-channel sampling of operators
نویسندگان
چکیده
منابع مشابه
some properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولA multi-channel multi-sampling rate theorem
The Möbius function is utilised to propose a class of multi-channel, multi-sampling rate theorems. Our construction facilitates a parallel decomposition of the Fourier transform into an array of general integral transform operators. A practical example is discussed which employs a complex square wave biorthonormal basis.
متن کاملTheory and Practice of Irregular Sampling
This chapter presents methods for the reconstruction of bandlimited functions from irregular samples. The first part discusses algorithms for a constructive solution of the irregular sampling problem. An important aspect of these algorithms is the explicit knowledge of the constants involved and efficient error estimates. The second part discusses the numerical implementation of these algorithm...
متن کاملIrregular Sampling in Approximation Subspaces
ABSTRACT We describe the irregular sampling problem for discretetime finite signals belonging to Fourier and wavelet based linear and nonlinear approximation subspaces. The problem is expressed as a linear system of equations which can be solved directly or iteratively. The existence of the solution depends on the rank of the matrix associated to the system. The standard iterative algorithm for...
متن کاملNFFT: Algorithm for irregular sampling
The nonuniform discrete Fourier transform (NDFT), used in many processing schemes, can be computed using a fast algorithm known as the non uniform fast Fourier transform (NFFT). The NFFT is not a new algorithm, but it is an approximation scheme that can be use to calculate an approximate spectrum. In one dimension, computational complexity of the NFFT is O(NlogN) which is a dramatic improvement...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied and Computational Harmonic Analysis
سال: 2010
ISSN: 1063-5203
DOI: 10.1016/j.acha.2009.10.006